- computationally infeasible problem
- вычислительно неразрешимая задача
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
computationally infeasible problem
Смотреть что такое "computationally infeasible problem" в других словарях:
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium
Cryptography — Secret code redirects here. For the Aya Kamiki album, see Secret Code. Symmetric key cryptography, where the same key is used both for encryption and decryption … Wikipedia
Commitment scheme — In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in… … Wikipedia
Independence of irrelevant alternatives — (IIA) is an axiom of decision theory and various social sciences. The word is used in different meanings in different contexts. Although they all attempt to provide a rational account of individual behavior or aggregation of individual… … Wikipedia
Digital signature — This article is about secure cryptographic signatures. For simple signatures in digital form, see Electronic signature. A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital… … Wikipedia
Venti — is a network storage system that permanently stores data blocks. A 160 bit SHA 1 hash of the data (called score by Venti) acts as the address of the data. This enforces a write once policy since no other data block can be found with the same… … Wikipedia
Unicity distance — is a term used in cryptography referring to the length of an original ciphertext needed to break the cipher by reducing the number of possible spurious keys to zero in a brute force attack. That is, after trying every possible key, there should… … Wikipedia
Combinatorial meta-analysis — (CMA) is the study of the behaviour of statistical properties of combinations of studies from a meta analytic dataset (typically in social science research). In an article that develops the notion of gravity in the context of meta analysis, Dr.… … Wikipedia
Power network design (IC) — In integrated circuits, electrical power is distributed to the components of the chip over a network of conductors on the chip. Power network design (IC) includes the analysis and design of such networks. As in all engineering, this involves… … Wikipedia
Phi-hiding assumption — The Phi Hiding assumption or Φ Hiding assumption is an assumption about the difficulty of finding small factors of φ( m ) where m is a number whose factorization is unknown, and φ is Euler s totient function. The security of many modern… … Wikipedia
